Solving Polynomial Systems in the Cloud with Polynomial Homotopy Continuation
نویسندگان
چکیده
Polynomial systems occur in many fields of science and engineering. Polynomial homotopy continuation methods apply symbolic-numeric algorithms to solve polynomial systems. We describe the design and implementation of our web interface and reflect on the application of polynomial homotopy continuation methods to solve polynomial systems in the cloud. Via the graph isomorphism problem we organize and classify the polynomial systems we solved. The classification with the canonical form of a graph identifies newly submitted systems with systems that have already been solved.
منابع مشابه
Numerical Stablity of Path Tracing in Polyhedral Homotopy Continuation Methods
The reliability of polyhedral homotopy continuation methods for solving a polynomial system becomes increasingly important as the dimension of the polynomial system increases. High powers of the homotopy continuation parameter t and ill-conditioned Jacobian matrices encountered in tracing of homotopy paths affect the numerical stability. We present modified homotopy functions with a new homotop...
متن کاملSolving polynomial systems via homotopy continuation and monodromy
We develop an algorithm to find all solutions of a generic system in a family of polynomial systems with parametric coefficients using numerical homotopy continuation and the action of the monodromy group. We argue that the expected number of homotopy paths that this algorithm needs to follow is roughly linear in the number of solutions. We demonstrate that our software implementation is compet...
متن کاملCmpsc : a Continuation Method for Polynomial Systems (c++ Version)
CMPSc is a C++ program for homotopy continuation methods to find all isolated solutions of a system of polynomial equations. The numerical methods for solving polynomial systems employed in CMPSc are equivalent to the ones used in a matlab program CMPSm. The focus of CMPSc is on implementation of the cheater’s homotopy. The software CMPSc, this manual and some numerical examples are available a...
متن کاملA bootstrapping approach for computing multiple solutions of differential equations
Discretizing systems of nonlinear algebraic differential equations yield polynomial systems. When using a fine discretization, the resulting polynomial system is often too large to solve using a direct solving approach. Our approach for solving such systems is to utilize a homotopy continuation based method arising from domain decomposition. This method solves polynomial systems arising from su...
متن کامل3 Cheater ’ s homotopy
CMPSc is a C++ program for homotopy continuation methods to find all isolated solutions of a system of polynomial equations. The numerical methods for solving polynomial systems employed in CMPSc are equivalent to the ones used in a matlab program CMPSm. The focus of CMPSc is on implementation of the cheater’s homotopy. The software CMPSc, this manual and some numerical examples are available a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015